Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations
نویسندگان
چکیده
منابع مشابه
O.-Centers: A New Type of Steiner Points for Computing Size-Optimal Quality-Guaranteed Delaunay Triangulations
We introduce a new type of Steiner points, called off-centers, as an alternative to circumcenters, to improve the quality of Delaunay triangulations. We propose a new Delaunay refinement algorithm based on iterative insertion of off-centers. We show that this new algorithm has the same quality and size optimality guarantees of the best known refinement algorithms. In practice, however, the new ...
متن کاملSize-optimal Steiner points for Delaunay-refinement on curved surfaces
An extension of the restricted Delaunay-refinement algorithm for surface mesh generation is described, where a new point-placement scheme is introduced to improve element quality in the presence of mesh size constraints. Specifically, it is shown that the use of off-centre Steiner points, positioned on the faces of the associated Voronoi diagram, typically leads to significant improvements in t...
متن کاملTriangulations with locally optimal Steiner points
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold angle α, the Delaunay refinement algorithms compute triangulations that have all angles at least α. Our algorithms have the same theoretical guarantees as the previous Delaunay refinement algorithms. The original Delauna...
متن کاملDelaunay Triangulations for Moving Points
This paper considers the problem of updating efficiently a Delaunay triangulation when vertices are moving under small perturbations. Its main contribution is a set of algorithms based on the concept of vertex tolerance. Experiment shows that it is able to outperform the naive rebuilding algorithm in certain conditions. For instance, when points, in two dimensions, are relocated by Lloyd’s iter...
متن کاملLEPP - Delaunay Algorithm: a Robust Tool for Producing Size-Optimal Quality Triangulations
The LEPP-Delaunay algorithm for the quality triangulation problem can be formulated in terms of the Delaunay insertion of midpoints of terminal edges (the common longest-edge of a pair of De-launay triangles) and boundary edges in the current mesh. In this paper we discuss theoretical results essentially based on the study of the triangle improvement properties of the basic point insertion oper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2008.06.002